Random multi-hopper model: super-fast random walks on graphs
نویسندگان
چکیده
منابع مشابه
Random Multi-Hopper Model. Super-Fast Random Walks on Graphs
We develop a model for a random walker with long-range hops on general graphs. This random multi-hopper jumps from a node to any other node in the graph with a probability that decays as a function of the shortest-path distance between the two nodes. We consider here two decaying functions in the form of the Laplace and Mellin transforms of the shortest-path distances. Remarkably, when the para...
متن کاملRandom Walks on Random Graphs
The aim of this article is to discuss some of the notions and applications of random walks on finite graphs, especially as they apply to random graphs. In this section we give some basic definitions, in Section 2 we review applications of random walks in computer science, and in Section 3 we focus on walks in random graphs. Given a graphG = (V,E), let dG(v) denote the degree of vertex v for all...
متن کاملRandom walks on graphs
Let G = (V,E) be a connected, undirected graph. We shall consider the following model of a random walk on G. The walk starts out at time 0 in some initial distribution on the vertex set V ; the initial condition may be deterministic, which corresponds to the distribution assigning probability 1 to a single vertex. The random walk is constructed as follows. There are independent unit rate Poisso...
متن کاملRandom and Pseudo-Random Walks on Graphs
Random walks on graphs have turned out to be a powerful tool in the design of algorithms and other applications. In particular, expander graphs, which are graphs on which random walks have particularly good properties, are extremely useful in complexity and other areas of computer science. In this chapter we study random walks on general regular graphs, leading to a the randomized logspace algo...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Complex Networks
سال: 2017
ISSN: 2051-1310,2051-1329
DOI: 10.1093/comnet/cnx043